منابع مشابه
A new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملTopology coloring
The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in differe...
متن کاملSome Weighted Integral Inequalities for Generalized Conformable Fractional Calculus
In this paper, we have obtained weighted versions of Ostrowski, Čebysev and Grüss type inequalities for conformable fractional integrals which is given by Katugompola. By using the Katugampola definition for conformable calculus, the present study confirms previous findings and contributes additional evidence that provide the bounds for more general functions.
متن کاملBetween coloring and list-coloring: μ-coloring
A new variation of the coloring problem, μ-coloring, is defined in this paper. Given a graph G and a function μ, a μ-coloring is a coloring where each vertex v of G must receive a color at most μ(v). It is proved that μ-coloring lies between coloring and list-coloring, in the sense of generalization of problems and computational complexity. The notion of perfection is extended for μ-coloring, l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Creative Education
سال: 2013
ISSN: 2151-4755,2151-4771
DOI: 10.4236/ce.2013.44037